#include<bits/stdc++.h>

using namespace std;
using ll = long long;
#define endl '\n'
char V[4]={'A','B','C','D'};
struct Edge{
    char x;
    char y;

}e[7]={
        {'A','C'},
        {'A','B'},
        {'A','D'},
        {'B','C'},
        {'B','C'},
        {'B','D'},
        {'B','D'},
};
int degree[4]={0};
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    for(int i=0;i<7;i++){
        char x=e[i].x;
        char y=e[i].y;
        degree[x-'A']++;
        degree[y-'A']++;
    }
    for(int i=0;i<4;i++){
        cout<<degree[i]<<endl;
    }
    int odd=0;
    for(int i=0;i<4;i++){
        if(degree[i]&1)
            ++odd;
    }
    if(odd==0){
        cout<<"Euler Circle"<<endl;
    }else if(odd==2){
        cout<<"Euler Path"<<endl;
    }else{
        cout<<"Not a Euler graph"<<endl;
    }
    return 0;
}
